package com.xinheyun.demo.leetcode;

import java.util.*;

/**
 * @description: TODO
 * @author: Sarah
 * @modified By: Sarah
 * @date: Created in 2021/9/8 16:08
 * @version:v1.0
 */
public class test40 {
// 输入: candidates = [10,1,2,7,6,1,5], target = 8,
// 输出: 1,1,2,5,6,7,10
//     [
//     [1,1,6],
//     [1,2,5],
//     [1,7],
//     [2,6]
//     ]

    public static void main(String[] args) {
        test40 test40 = new test40();
        List<List<Integer>> lists = test40.combinationSum2(new int[]{10, 1, 2, 7, 6, 1, 5}, 8);
        System.out.println(lists);

    }

    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        Arrays.sort(candidates);
        List<List<Integer>> lists = new ArrayList<>();
        List<List<Integer>> bag = new ArrayList<>();
        for(int i =0 ;i<=candidates.length;i++){
            for(int j =target; j>=target;j--){

            }
        }
        return null;
    }


}
